Hierarchical Image Computation with Dynamic Conjunction Scheduling
نویسندگان
چکیده
Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based on OBDDs use a partitioned representation of the transition relation to keep the OBDD-sizes manageable. This paper presents algorithms for building a hierarchically partitioned transition relation and conjunction scheduling based on this partitioning. The conjunction scheduling algorithm allows to dynamically reorder partitions and is targeted to improve the AndExist operation. Model checking experiments prove the effectiveness of the new algorithms.
منابع مشابه
Modular Partitioning and Dynamic Conjunction Scheduling in Image Computation
Image computation is the core task in any formal verification applications like reachable states computation or model checking. In OBDD-based image computation a partitioned representation of the transition relation is used. The quality of the partitioning and the schedule in which the partitions are processed is crucial for the efficiency of the image computation. In this paper we describe an ...
متن کاملFine-Grain Conjunction Scheduling for Symbolic Reachability Analysis
In symbolic model checking, image computation is the process of computing the successors of a set of states. Containing the cost of image computation depends critically on controlling the number of variables that appear in the functions being manipulated; this in turn depends on the order in which the basic operations of image computation—conjunctions and quantifications—are performed. In this ...
متن کاملDynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کاملBorder-Block Triangular Form and Conjunction Schedule in Image Computation
Conjunction scheduling in image computation consists of clustering the parts of a transition relation and ordering the clusters, so that the size of the BDDs for the intermediate results of image computation stay small. We present an approach based on the analysis and permutation of the dependence matrix of the transition relation. Our algorithm computes a bordered-block lower triangular form o...
متن کاملComputation Optical Flow Using Pipeline Architecture
Accurate estimation of motion from time-varying imagery has been a popular problem in vision studies, This information can be used in segmentation, 3D motion and shape recovery, target tracking, and other problems in scene analysis and interpretation. We have presented a dynamic image model for estimating image motion from image sequences, and have shown how the solution can be obtained from a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001